Programs, Proofs, Processes
نویسندگان
چکیده
منابع مشابه
soclAL pROCESSES AND pROOFS OF THEOREMS AND PROGRAMS
It is exactly those processes which mediate proofs of theorems in mathematics that require that program verification, as perceived by a large segment of the computer science community, is bound to fail in its primary purpose: to dramatically increase one’s confidence in the correct functioning of a particular piece of software. This is a view that we have found to be shocking to many, but the k...
متن کاملContracting proofs to programs
This work describes a family of homomorphisms that contract natural deductions into typed ^-expressions, with the property that a convergence proof for an untyped program for function / is contracted to a typed program for /. The main novelties, compared to previous works on extracting algorithms from proofs, are the reading of deductions themselves as programs, and that instead of a constructi...
متن کاملFeasible Programs from Proofs
We restrict induction and recursion on notation in all nite types so as to characterize the polynomial time computable functions. The restrictions are obtained by enriching the type structure with the formation of types (and formulas A (B as well as 8 x A with \complete" variables x, and by adding linear concepts to the lambda calculus (for object terms and proof terms). For the arithmetical sy...
متن کاملProofs as Efficient Programs
There may, indeed, be other uses of the system than its use as a logic. Logic and theory of computation have been intertwined since their first days. The formalized notion(s) of effective computation are at first technical tools for the investigation of first order systems, and only ten years later – in the hands of John von Neumann – become the blueprints of engineered physical devices. Genera...
متن کاملCombining Proofs and Programs
Programming languages based on dependent type theory promise two great advances: flexibility and security. With the type-level computation afforded by dependent types, algorithms can be more generic, as the type system can express flexible interfaces via programming. Likewise, type-level computation can also express data structure invariants, so that programs can be proved correct through type ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2012
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-012-9398-z